Directions in Connectionist Research: Tractable Computations Without Syntactically Structured Representations
نویسندگان
چکیده
منابع مشابه
Directions in Connectionist Research: Tractable Computations without Syntactically Structured Representations
(1981), the Cognitive Science Society meetings in 1984, and the publication of the PDP volumes (Rumelhart, McClelland, and the PDP Study Group, 1986, McClelland, Rumelhart, and the PDP Study Group, 1986). Figure 1: A prototypical example of a three-layer feed forward network, used by Plunkett and Marchman (1991) to simulate learning the past-tense of English verbs. The input units encode repres...
متن کاملList automata with syntactically structured output
A new type of abstract automaton is introduced, and both formal and linguistic implications are discussed, most importantly a new possibility of proving certain formal properties of (natural) languages and their grammars (such as context-freeness) and of refinement of the Chomsky hierarchy.
متن کاملCross-Lingual Syntactically Informed Distributed Word Representations
We develop a novel cross-lingual word representation model which injects syntactic information through dependencybased contexts into a shared cross-lingual word vector space. The model, termed CLDEPEMB, is based on the following assumptions: (1) dependency relations are largely language-independent, at least for related languages and prominent dependency links such as direct objects, as evidenc...
متن کاملScaling Connectionist Compositional Representations
The Recursive Auto-Associative Memory (RAAM) has come to dominate connectionist investigations into representing compositional structure. Although an adequate model when dealing with limited data, the capacity of RAAM to scale-up to real-world tasks has been frequently questioned. RAAM networks are difficult to train (due to the moving target effect) and as such training times can be lengthy. I...
متن کاملA Structured Connectionist Unification Algorithm
A connectionist unification algorithm is presented. It utilizes the fact that the most general unifier of two terms corresponds to a finest valid equivalence relation defined on a occurrence-label representation of the unification problem. The algorithm exploits the maximal parallelism inherent in the computation of such a finest valid equivalence relation while using only computational feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Metaphilosophy
سال: 1997
ISSN: 0026-1068,1467-9973
DOI: 10.1111/1467-9973.00040